Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines
نویسنده
چکیده
Article history: Received 15 November 2009 Received in revised form 28 March 2010 Accepted 22 May 2010 Available online 27 May 2010
منابع مشابه
Corner cutting with trapezoidal augmentation for area-preserving smoothing of polygons and polylines
Recently, a new subdivision method was introduced by the author for smoothing polygons and polylines while preserving the enclosed area [Gordon D. Corner cutting and augmentation: an area-preserving method for smoothing polygons and polylines. Computer Aided Geometric Design 2010; 27(7):551–62]. The new technique, called ‘‘corner cutting and augmentation’’ (CCA), operates by cutting cornerswith...
متن کاملCorner cutting systems
If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are ...
متن کاملA Non-trigonometric, Pseudo Area Preserving, Polyline Smoothing Algorithm
A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though th...
متن کاملA new core-based morphing algorithm for polygons
Morphing is a process of shape transformation between two objects. This paper focuses on morphing of simple polygons. In general, the key part of most morphing methods is to find correspondence between vertices of both objects. We present a new algorithm trying to avoid this step. Using an idea of intersection of two polygons (called core) the problem of morphing polygons is decomposed to sever...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 27 شماره
صفحات -
تاریخ انتشار 2010